Lecture 22 : Space Filling Diagrams

نویسنده

  • Pankaj K. Agarwal
چکیده

For geometric and topological analysis and for understanding the nonbond interactions between atoms a protein is modeled as a set of spheres in R, each sphere corresponding to one atom of the protein. This model, known as the space-filling diagram, assumes that the exact position of each atom is known. We thus represent a protein P as a set {B1, . . . , Bn} of balls in R. Let zi (resp. ri) denote the center (resp. radius) of Bi. The union ⋃ iBi is the space filled by P. The coordinates of the centers are typically determined using X-ray crystallography and NMR methods. The radius ri is typically the Van der Waals radius, defining the impenetrable volume of an atom. The smallest distance between neighboring atoms (in the crystalline state) that are not covalently bonded is the sum of their van der Waals radii. A range of values is assigned to van der Waals radii because it depends on how the atom is covalently bonded. Typical values are given in Table 22.1, which are originally taken from [1].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Binary Decision Diagrams

A propositional formula is determined up to logical equivalence by its truth table. If the formula has n variables then its truth table requires space Ω(2n) to represent. In this lecture we introduce a data structure called a binary decision diagram which gives a representation that is potentially much more compact. We furthermore show how binary decision diagrams can be used to decide satisfia...

متن کامل

Lectures on configuration space methods for sunrise-type diagrams

In this lecture series I will give a fundamental insight into configuration space techniques which are of help to calculate a broad class of Feynman diagrams, the sunrisetype diagrams. Applications are shown along with basic concepts and techniques.

متن کامل

The gallery length filling function and a geometric inequality for filling length

We exploit duality considerations in the study of singular combinatorial 2-discs (diagrams) and are led to the following innovations concerning the geometry of the word problem for finite presentations of groups. We define a filling function called gallery length that measures the diameter of the 1-skeleton of the dual of diagrams; we show it to be a group invariant and we give upper bounds on ...

متن کامل

Some duality conjectures for finite graphs and their group theoretic consequences

We pose some graph theoretic conjectures about duality and the diameter of maximal trees in planar graphs, and we give innovations in the following two topics in Geometric Group Theory, where the conjectures have applications. (i.) Central Extensions. We describe an electrostatic model concerning how van Kampen diagrams change when one takes a central extension of a group. Modulo the conjecture...

متن کامل

Root systems and generalized associahedra

Contents Root systems and generalized associahedra 1 Root systems and generalized associahedra 3 Lecture 1. Reflections and roots 5 1.1. The pentagon recurrence 5 1.2. Reflection groups 6 1.3. Symmetries of regular polytopes 8 1.4. Root systems 11 1.5. Root systems of types A, B, C, and D 13 Lecture 2. Dynkin diagrams and Coxeter groups 15 2.1. Finite type classification 15 2.2. Coxeter groups ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003